Dense forests and Danzer sets

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dense forests and Danzer sets

A set Y ⊆ R that intersects every convex set of volume 1 is called a Danzer set. It is not known whether there are Danzer sets in R with growth rate O(T ). We prove that natural candidates, such as discrete sets that arise from substitutions and from cut-and-project constructions, are not Danzer sets. For cut and project sets our proof relies on the dynamics of homogeneous flows. We consider a ...

متن کامل

Dense Admissible Sets

Call a set of integers {b1, b2, . . . , bk} admissible if for any prime p, at least one congruence class modulo p does not contain any of the bi. Let ρ ∗(x) be the size of the largest admissible set in [1, x]. The Prime k-tuples Conjecture states that any for any admissible set, there are infinitely many n such that n+b1, n+b2, . . . n+bk are simultaneously prime. In 1974, Hensley and Richards ...

متن کامل

Dense Subsets of Ordered Sets

Some modifications of the definition of density of subsets in ordered (= partially ordered) sets are given and the corresponding concepts are compared.

متن کامل

Stationary countable dense random sets

We study the probability theory of countable dense random subsets of (uncountably infinite) Polish spaces. It is shown that if such a set is stationary with respect to a transitive (locally compact) group of symmetries then any event which concerns the random set itself (rather than accidental details of its construction) must have probability zero or one. Indeed the result requires only quasi-...

متن کامل

Contagious Sets in Dense Graphs

We study the activation process in undirected graphs known as bootstrap percolation: a vertex is active either if it belongs to a set of initially activated vertices or if at some point it had at least r active neighbors, for a threshold r that is identical for all vertices. A contagious set is a vertex set whose activation results with the entire graph being active. Let m(G, r) be the size of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales scientifiques de l'École normale supérieure

سال: 2016

ISSN: 0012-9593,1873-2151

DOI: 10.24033/asens.2303